When Does Quasi-random Work?
نویسنده
چکیده
[10, 22] presented various ways for introducing quasi-random numbers or derandomization in evolution strategies, with in some cases some spectacular claims on the fact that the proposed technique was always and for all criteria better than standard mutations. We here focus on the quasi-random trick and see to which extent this technique is efficient, by an in-depth analysis including convergence rates, local minima, plateaus, nonasymptotic behavior and noise. We conclude to the very stable, efficient and straightforward applicability of quasi-random numbers in continuous evolutionary algorithms.
منابع مشابه
Faster Quasi Random Number Generator for Most Monte Carlo Simulations
Generating quasi-random sequences for Monte Carlo simulations has been proved of interest when comparing results with numbers coming from conventional pseudorandom sequences. Despite a fair amount of sound theoretical work on random number generation algorithms, theoretical gain is often eradicated by poor computer implementations. Recently, one of the authors of this paper showed that massive ...
متن کاملEfficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes
In this paper we present efficient implementations of McEliece variants using quasi-dyadic codes. We provide secure parameters for a classical McEliece encryption scheme based on quasi-dyadic generalized Srivastava codes, and successively convert our scheme to a CCA2-secure protocol in the random oracle model applying the Fujisaki-Okamoto transform. In contrast with all other CCA2-secure code-b...
متن کاملWhen Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
Recently quasi-Monte Carlo algorithms have been successfully used for multivariate integration of high dimension d, and were signiicantly more eecient than Monte Carlo algorithms. The existing theory of the worst case error bounds of quasi-Monte Carlo algorithms does not explain this phenomenon. This paper presents a partial answer to why quasi-Monte Carlo algorithms can work well for arbitrari...
متن کاملQuasi-random Agents for Image Transition and Animation
Quasi-random walks show similar features as standard random walks, but with much less randomness. We utilize this established model from discrete mathematics and show how agents carrying out quasi-random walks can be used for image transition and animation. The key idea is to generalize the notion of quasi-random walks and let a set of autonomous agents perform quasi-random walks painting an im...
متن کاملStatistical distributions of quasi-optimal paths in the traveling salesman problem: the role of the initial distribution of cities
Statistical distributions of quasi-optimal paths in the traveling salesman problem: the role of the initial distribution of cities Revista Mexicana de Física, Solutions to Traveling Salesman Problem have been obtained with several algorithms. However, few of them have discussed about the statistical distribution of lengths for the quasi-optimal path obtained. For a random set of cities such a d...
متن کامل